Swan-like results for binomials and trinomials over finite fields of odd characteristic
نویسندگان
چکیده
Swan (1962) gives conditions under which the trinomial x+x+1 over F2 is reducible. Vishne (1997) extends this result to trinomials over extensions of F2. In this work we determine the parity of the number of irreducible factors of all binomials and some trinomials over the finite field Fq, where q is a power of an odd prime.
منابع مشابه
New classes of permutation binomials and permutation trinomials over finite fields
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinational design, communication theory and so on. Permutation binomials and trinomials attract people’s interest due to their simple algebraic form and additional extraordinary properties. In t...
متن کاملDivisibility of polynomials over finite fields and combinatorial applications
Consider a maximum-length shift-register sequence generated by a primitive polynomial f over a finite field. The set of its subintervals is a linear code whose dual code is formed by all polynomials divisible by f . Since the minimum weight of dual codes is directly related to the strength of the corresponding orthogonal arrays, we can produce orthogonal arrays by studying divisibility of polyn...
متن کاملNew Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic
In this paper, a class of permutation trinomials of Niho type over finite fields with even characteristic is further investigated. New permutation trinomials from Niho exponents are obtained from linear fractional polynomials over finite fields, and it is shown that the presented results are the generalizations of some earlier works.
متن کاملNew Permutation Trinomials Constructed from Fractional Polynomials
Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six new classes of permutation trinomials over finite fields of even characteristic are constructed from six fractional polynomials. Further, three classes of p...
متن کاملA Recursive Construction of Permutation Polynomials over $\mathbb{F}_{q^2}$ with Odd Characteristic from R\'{e}dei Functions
In this paper, we construct two classes of permutation polynomials over Fq2 with odd characteristic from rational Rédei functions. A complete characterization of their compositional inverses is also given. These permutation polynomials can be generated recursively. As a consequence, we can generate recursively permutation polynomials with arbitrary number of terms. More importantly, the conditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 61 شماره
صفحات -
تاریخ انتشار 2011